Sets of matrices with given joint numerical range
نویسندگان
چکیده
منابع مشابه
GENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...
متن کاملNumerical Range for Random Matrices
We analyze the numerical range of high-dimensional random matrices, obtaining limit results and corresponding quantitative estimates in the non-limit case. For a large class of random matrices their numerical range is shown to converge to a disc. In particular, numerical range of complex Ginibre matrix almost surely converges to the disk of radius √ 2. Since the spectrum of non-hermitian random...
متن کاملgeneralized joint higher-rank numerical range
the rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. for noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. in this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, generaliz...
متن کاملA Symmetric Numerical Range for Matrices
For each norm v on <en, we define a numerical range Z., which is symmetric in the sense that Z. =Z"D, where vD is the dual norm. We prove that, for aE <enn, Z.(a) contains the classical field of values V(a). In the special case that v is the lcnorm, Z.(a) is contained in a set G(a) of Gershgorin type defined by C. R. Johnson. When a is in the complex linear span of both the Hennitians and the v...
متن کاملConvexity of the Joint Numerical Range
We consider linearly independent families of Hermitian matrices {A1, . . . , Am} so thatWk(A) is convex. It is shown that m can reach the upper bound 2k(n− k) + 1. A key idea in our study is relating the convexity of Wk(A) to the problem of constructing rank k orthogonal projections under linear constraints determined by A. The techniques are extended to study the convexity of other generalized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2006.05.019